package Euler399;

import java.math.*;

import ReusableCode.*;

public class FibonacciSquare {

	public static void main(String[] args) {
		BigInteger a = BigInteger.ONE;
		BigInteger b = BigInteger.ONE;
		BigInteger temp = BigInteger.ONE;
		BigInteger squarefree = new BigInteger("1");
		long count = 0;

		while (count < 10000000)
		{
			temp = a.add(b);
			a = b;
			b = temp;
			if(!MathFunctions.hasSquareDivisor(b))
			{
				System.out.println(b);
				squarefree = b;
				count++;
			}
			//count++;
			//System.out.println(count + "\n\n\n\n");
		}
	}
}
